An Hybrid Explicit Multicast/unicast Recursif Approach for Multicast Routing Ali Boudani and Bernard Cousin
نویسندگان
چکیده
In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and to deliver multicast packets to all destinations. In order to construct a multicast tree, the source encodes the list of destination addresses in a branch message. This message discovers the tree branching routers and creates a multicast routing state in each of these routers. For multicast packets delivery, it uses recursive unicast trees where packets travel from a branching router to another following the tree constructed by the branch message. Key-words: Multicast, IP, Routing protocol, Explicit Multicast (Résumé : tsvp) * Ali.Boudani Bernard.Cousin @irisa.fr Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (UMR 6074) Université de Rennes 1 – Insa de Rennes et en Automatique – unité de recherche de Rennes SEM : approche hybride multicast explicite/unicast récursif pour le routage multicast Résumé : Dans ce papier, nous proposons Simple Explicit Multicast (SEM), un protocole de routage multicast qui utilise une méthode efficace pour construire les arbres multicast et pour acheminer les paquets multicast. Afin de construire l’arbre multicast, la source encode la liste des adresses IP des destinataires dans un message branch. Ce message utilise le principe du protocole Xcast et a pour rôle de découvrir les routeurs d’embranchement de l’arbre multicast. Seuls, les routeurs d’embranchement de l’arbre mémorisent les entrées de routage pour une session multicast. Pour acheminer les paquets multicast, SEM utilise le principe des arbres unicast récursifs, l’origine proposé dans REUNITE. Les paquets sont acheminés d’un routeur d’embranchement à un autre suivant l’arbre construit par le message branch. Le protocole SEM est original. En effet, pour simplifier l’allocation d’une adresse multicast, SEM utilise la notion de canal source-spécifique S, G o S est l’adresse unicast de la source et G est une adresse multicast standard. SEM réduit aussi les entrées de routage dans les routeurs et construit un arbre des plus courts chemins, et pas un arbre partag comme la plupart des protocoles multicast conventionnels. Mots clés : Multicast, IP, Protocole de routage, Multicast explicite An Hybrid Explicit Multicast/Unicast Recursif Approach for Multicast Routing 3
منابع مشابه
An hybrid explicit multicast/recursive unicast approach for multicast routing
In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and to deliver multicast packets to all destinations. In order to construct a multicast tree, the source encodes the list of destination addresses in a branch message. This message discovers the tree branching routers and creates a multicast routing state in eac...
متن کاملSEM: A New Small Group Multicast Routing Protocol
Recently several multicast mechanisms [3], known as small group multicast, were proposed that scale better with the number of multicast sessions than traditional multicast does. In this paper, we propose a new approach, Simple Explicit Multicast (SEM), which uses an efficient method to construct multicast trees and deliver multicast packets. SEM is original because it adopts the source-specific...
متن کاملMPLS Multicast Traffic Engineering
In this paper, we present multicast traffic engineering and we compare it to unicast traffic engineering. We study the advantages given by the integration of multicasting and MPLS. We present current proposals for multicast traffic engineering and using MPLS network. We describe our approach, the MPLS multicast tree (MMT) protocol. In order to reduce forwarding states and enhance scalability, M...
متن کاملMulticast Tree in Mpls Network Using Mmt and Mmt2 Protocols Ali Boudani and Bernard Cousin
In this paper, we study multicast tree construction in MPLS network. We discuss the difficulty in combining multicast and MPLS in a network. We describe some MPLS proposals for the multicast traffic and we justify the need for defining a new protocol. Thereafter we propose MMT, the MPLS Multicast Tree protocol, which uses MPLS LSP** between multicast tree branching nodes in order to reduce the ...
متن کاملA new approach to construct multicast trees in MPLS networks
In this paper1, we present a new approach to construct multicast trees in MPLS networks. This approach utilizes MPLS LSPs between multicast tree branching node routers in order to reduce forwarding states and enhance scalability. In our approach only routers that are acting as multicast tree branching node for a group need to keep forwarding state for that group. All other non-branching node ro...
متن کامل